Non-Binary Diameter Perfect Constant-Weight Codes

Diameter perfect codes form a natural generalization for codes. They are based on the code-anticode bound which generalizes sphere-packing bound. The was proved by Delsarte distance-regular graphs and it holds some other metrics too. In this paper we prove non-binary constant-weight with Hamming metric characterize diameter maximum size anticodes these We distinguish between six families of four anticodes. Each one raises different questions. consider questions leave lot ground further research. Finally, as consequence, t-intersecting related to well-known Erdos-Ko-Rado theorem, constructed.